The capacitated team orienteering problem with incomplete service

The split delivery capacitated team orienteering problem

In this paper we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the profit collected is maximized, while satisfying constraints on the maximum time duration of each rou...

The Capacitated Team Orienteering Problem: Bee Colony Optimization

In this paper the capacitated team orienteering problem have been applied as a tool for carriers to avoid empty returns when trucks do not work with full load. The software based on bee colony optimization technique is developed for solving the problem. Numerical example is solved and the result is shown to depict the possibility of the proposed algorithm.

Team Orienteering Problem with Decreasing Profits

Team Orienteering with Decreasing Profits (DP-TOP) extends the classical Team Orienteering problem (TOP) by considering the profit of each client as a decreasing function of time. It consists of maximizing the sum of collected profit by a fixed number K of vehicles, visiting each client at most once. In this work, we present lower bounds based on a Dantzig-Wolfe decomposition and column generat...

The capacitated team orienteering and profitable tour problems

A huge number of papers appeared in the literature which study the well known Traveling Salesman Problem (TSP) and its generalizations to the case of multiple vehicles known as Vehicle Routing Problems (VRPs). While there exists one and only one TSP, many problems belong to the class of VRPs (see Toth, Vigo (2002)). In the TSP and in the VRPs all customers need to be visited. This means that in...

Metaheuristics for the team orienteering problem